Text segmentation by product partition models and dynamic programming
نویسندگان
چکیده
منابع مشابه
Optimal Multi-Paragraph Text Segmentation by Dynamic Programming
There exist several methods of calculating a similarity curve, or a sequence of similarity values, representing the lexical cohesion of successive text constituents, e.g., paragraphs. Methods for deciding the locations of fragment boundaries are, however, scarce. We propose a fragmentation method based on dynamic programming. The method is theoretically sound and guaranteed to provide an optima...
متن کاملLinear Text Segmentation using a Dynamic Programming Algorithm
In this paper we introduce a dynamic programming algorithm to perform linear text segmentation by global minimization of a segmentation cost function which consists of: (a) within-segment word similarity and (b) prior information about segment length. The evaluation of the segmentation accuracy of the algorithm on Choi's text collection showed that the algorithm achieves the best segmentation a...
متن کاملDynamic Partition Models
We present a new approach for learning compact and intuitive distributed representations with binary encoding. Rather than summing up expert votes as in products of experts, we employ for each variable the opinion of the most reliable expert. Data points are hence explained through a partitioning of the variables into expert supports. The partitions are dynamically adapted based on which expert...
متن کاملAutomatic segmentation of TIMIT by dynamic programming
We propose an algorithm based on the principle of dynamic programming for the automatic segmentation of continuous speech into phoneme-like units. A measure of local dissimilarity among consecutive feature vectors is combined with a knowledge of the expected statistical distribution of the segment lengths within a dynamic programming framework to obtain an optimal placement of segment boundarie...
متن کاملSegmentation and Concatenation of Edgel Lists by Dynamic Programming and Stochastic Models
This paper describes a shape recognition method which uses a reference template to edit linked lists of edgels by concatenation and re-segmentation to give an optimal match. Dynamic programming is used to find the optimal re-segmentation, and is tolerant to distortion, outlines embedded in longer lists, gaps and missing portions. Unlike previous work, the combinatorial advantage of using edge l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical and Computer Modelling
سال: 2004
ISSN: 0895-7177
DOI: 10.1016/s0895-7177(04)90008-8